Quantum random walk and tight-binding model subject to projective measurements at random times
نویسندگان
چکیده
What happens when a quantum system undergoing unitary evolution in time is subject to repeated projective measurements the initial state at random times? A question of general interest is: How does survival probability $S_m$, namely, that an survives even after $m$ number measurements, behave as function $m$? We address these issues context two paradigmatic systems, one, walk evolving discrete time, and other, tight-binding model continuous with both defined on one-dimensional periodic lattice finite sites $N$. For models, we present several numerical analytical results hint curious nature measurement dynamics. In particular, unveil every continues projected component instantaneous state, average typical decay exponential for large $m$. By contrast, if leftover component, what remains has been performed, exhibits characteristic values, $m_1^\star(N) \sim N$ $m_2^\star(N) N^\delta$ $\delta >1$. These scales are such (i) satisfying $m < m_1^\star(N)$, $m^{-2}$, (ii) \ll m m_2^\star(N)$, $m^{-3/2}$, while (iii) \gg exponential. find our hold independently choice distribution times between successive have corroborated by wide range distributions. This fact hints robustness ubiquity derived results.
منابع مشابه
A Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملa random walk with exponential travel times
consider the random walk among n places with n(n - 1)/2 transports. we attach an exponential random variable xij to each transport between places pi and pj and take these random variables mutually independent. if transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملCut times for Simple Random Walk Cut times for Simple Random Walk
Let S(n) be a simple random walk taking values in Z d. A time n is called a cut time if S0; n] \ Sn + 1; 1) = ;: We show that in three dimensions the number of cut times less than n grows like n 1? where = d is the intersection exponent. As part of the proof we show that in two or three dimensions PfS0; n] \ Sn + 1; 2n] = ;g n ? ; where denotes that each side is bounded by a constant times the ...
متن کاملQuantum Random Walk via Classical Random Walk With Internal States
In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...
متن کاملA random walk approach to quantum algorithms.
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2022
ISSN: ['1742-5468']
DOI: https://doi.org/10.1088/1742-5468/ac5dc0